package bite;
import java.util.*;
/**
 * Creared with IntelliJ IDEA.
 * Description:【乒乓球筐】nowcoder有两盒（A、B）乒乓球，有红双喜的、有亚力亚的……现在他需要判别A盒是否包含了B盒中所有的种类，并且每种球的数量不少于B盒中的
 * 数量，该怎么办呢？
 * User:yxd
 * Date:2022-07-02
 * Time:17:06
 */
public class Day45_1 {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        while(input.hasNext()){
            String str = input.next();
            String sub = input.next();
            //使用两个map就可以了
            Map<Character,Integer> map1 = new HashMap<>();
            Map<Character,Integer> map2 = new HashMap<>();
            for(int i = 0;i < str.length();i ++){
                if(!map1.containsKey(str.charAt(i))){
                    map1.put(str.charAt(i),1);
                }else{
                    map1.put(str.charAt(i),map1.get(str.charAt(i)) + 1);
                }
            }
            for(int i = 0;i < sub.length();i ++){
                if(!map2.containsKey(sub.charAt(i))){
                    map2.put(sub.charAt(i),1);
                }else{
                    map2.put(sub.charAt(i),map2.get(sub.charAt(i)) + 1);
                }
            }
            //标记
            boolean flg = true;
            for (int i = 0; i < sub.length(); i++) {
                if(map1.containsKey(sub.charAt(i))){
                    if(map1.get(sub.charAt(i)) < map2.get(sub.charAt(i))){
                        flg = false;
                        break;
                    }
                }else{
                    flg = false;
                    break;
                }
            }
            if(flg){
                System.out.println("Yes");
            }else {
                System.out.println("No");
            }
        }
    }
}
